The electric vehicle routing problem with backhauls
نویسندگان
چکیده
منابع مشابه
A goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملThe Electric Two-echelon Vehicle Routing Problem
Two-echelon distribution systems are attractive from an economical standpoint and help keeping large vehicles out of densely populated city centers. Large trucks can be used to deliver goods to intermediate facilities in accessible locations, whereas smaller vehicles allow to reach the final customers. Due to their reduced size, pollution, and noise emissions, multiple distribution companies ar...
متن کاملA new tabu search algorithm for the vehicle routing problem with backhauls
In the distribution of goods from a central depot to geographically dispersed customers happens quite frequently that some customers, called linehauls, receive goods from that depot while others, named backhauls, send goods to it. This situation is described and studied by the vehicle routing problem with backhauls. In this paper we present a new tabu search algorithm that starting from pseudo-...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملAn adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls
● If one considers the instances with Q= 2 with respect to those with Q= 1, the routing cost decreases by 44.30% in the case of 10 customers, up to 47.65% in the case of 50 customers. ● If one compares the instances with Q= 4 to those with Q= 2, the routing cost decreases by 38.72% in the case of 10 customers, up to 46.06% in the case of 40 customers. ● If one considers the instances with Q= 6 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2019.6.001